0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.13/0.35	% Computer   : n006.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1200
0.13/0.35	% WCLimit    : 120
0.13/0.35	% DateTime   : Tue Jul 13 13:09:56 EDT 2021
0.13/0.35	% CPUTime    : 
0.13/0.35	% Number of cores: 8
0.13/0.35	% Python version: Python 3.6.8
0.13/0.35	# Version: 2.6rc1-ho
0.13/0.36	# No SInE strategy applied
0.13/0.36	# Trying AutoSched0 for 59 seconds
0.21/0.44	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S07AI
0.21/0.44	# and selection function SelectCQGrArEqFirst.
0.21/0.44	#
0.21/0.44	# Preprocessing time       : 0.052 s
0.21/0.44	# Presaturation interreduction done
0.21/0.44	
0.21/0.44	# Proof found!
0.21/0.44	# SZS status Theorem
0.21/0.44	# SZS output start CNFRefutation
0.21/0.44	thf(mimplies, axiom, (mimplies)=(^[X6:$i > $o, X7:$i > $o, X26:$i]:(~(X6 @ X26)|X7 @ X26)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.21/0.44	thf(mnot, axiom, (mnot)=(^[X6:$i > $o, X3:$i]:~(X6 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)).
0.21/0.44	thf(mor, axiom, (mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(X6 @ X3|X7 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)).
0.21/0.44	thf(axiom_D_for_r1, axiom, mvalid @ (mforall_prop @ (^[X6:$i > $o]:mimplies @ (mbox @ r1 @ X6) @ (mnot @ (mbox @ r1 @ (mnot @ X6))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_D_for_r1)).
0.21/0.44	thf(mforall_prop, axiom, (mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:![X10:$i > $o]:X9 @ X10 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mforall_prop)).
0.21/0.44	thf(mbox, axiom, (mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:![X14:$i]:(~(X13 @ X3 @ X14)|X6 @ X14)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mbox)).
0.21/0.44	thf(mvalid, axiom, (mvalid)=(^[X6:$i > $o]:![X3:$i]:X6 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.21/0.44	thf(axiom_I_for_r4_r1, axiom, mvalid @ (mforall_prop @ (^[X6:$i > $o]:mimplies @ (mbox @ r4 @ X6) @ (mbox @ r1 @ X6))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_I_for_r4_r1)).
0.21/0.44	thf(axiom_r1, axiom, mvalid @ (mforall_ind @ (^[X1:mu]:mimplies @ (maths_teacher @ X1) @ (mbox @ r4 @ (good_in_maths @ X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_r1)).
0.21/0.44	thf(mforall_ind, axiom, (mforall_ind)=(^[X8:mu > $i > $o, X3:$i]:![X1:mu]:X8 @ X1 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mforall_ind)).
0.21/0.44	thf(axiom_a6, axiom, mvalid @ (maths_teacher @ john), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_a6)).
0.21/0.44	thf(mexists_ind, axiom, (mexists_ind)=(^[X11:mu > $i > $o, X43:$i]:~(![X46:mu]:~(X11 @ X46 @ X43))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mexists_ind)).
0.21/0.44	thf(mdia, axiom, (mdia)=(^[X13:$i > $i > $o, X6:$i > $o, X60:$i]:~(![X63:$i]:(~(X13 @ X60 @ X63)|~(X6 @ X63)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mdia)).
0.21/0.44	thf(conj, conjecture, mvalid @ (mexists_ind @ (^[X1:mu]:mdia @ r1 @ (good_in_maths @ X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)).
0.21/0.44	thf(c_0_14, axiom, (mimplies)=(^[X6:$i > $o, X7:$i > $o, X26:$i]:(~(X6 @ X26)|X7 @ X26)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mimplies, mnot]), mor])).
0.21/0.44	thf(c_0_15, plain, ![X925:$i, X930:$i > $o]:(~(![X931:$i]:(~r1 @ X925 @ X931|X930 @ X931))|~(![X932:$i]:(~r1 @ X925 @ X932|~X930 @ X932))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_D_for_r1, mnot]), c_0_14]), mforall_prop]), mbox]), mvalid])])).
0.21/0.44	thf(c_0_16, plain, ![X1395:$i, X1400:$i > $o]:(~(![X1401:$i]:(~r4 @ X1395 @ X1401|X1400 @ X1401))|![X1402:$i]:(~r1 @ X1395 @ X1402|X1400 @ X1402)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_I_for_r4_r1, c_0_14]), mforall_prop]), mbox]), mvalid])])).
0.21/0.44	thf(c_0_17, plain, ![X2314:$i, X2315:$i > $o]:(((r1 @ X2314 @ (esk30_2 @ X2314 @ X2315)|r1 @ X2314 @ (esk29_2 @ X2314 @ X2315))&(X2315 @ (esk30_2 @ X2314 @ X2315)|r1 @ X2314 @ (esk29_2 @ X2314 @ X2315)))&((r1 @ X2314 @ (esk30_2 @ X2314 @ X2315)|~X2315 @ (esk29_2 @ X2314 @ X2315))&(X2315 @ (esk30_2 @ X2314 @ X2315)|~X2315 @ (esk29_2 @ X2314 @ X2315)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])).
0.21/0.44	thf(c_0_18, plain, ![X508:$i, X512:mu]:(~maths_teacher @ X512 @ X508|![X513:$i]:(~r4 @ X508 @ X513|good_in_maths @ X512 @ X513)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_r1, c_0_14]), mforall_ind]), mbox]), mvalid])])).
0.21/0.44	thf(c_0_19, plain, ![X1744:$i]:maths_teacher @ john @ X1744, inference(apply_def,[status(thm)],[axiom_a6, mvalid])).
0.21/0.44	thf(c_0_20, plain, ![X2377:$i, X2378:$i > $o, X2380:$i]:((r4 @ X2377 @ (esk44_2 @ X2377 @ X2378)|(~r1 @ X2377 @ X2380|X2378 @ X2380))&(~X2378 @ (esk44_2 @ X2377 @ X2378)|(~r1 @ X2377 @ X2380|X2378 @ X2380))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])).
0.21/0.44	thf(c_0_21, plain, ![X3:$i, X4:$i > $o]:(X4 @ (esk30_2 @ X3 @ X4)|~X4 @ (esk29_2 @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.21/0.44	thf(c_0_22, plain, ![X3:$i, X4:$i > $o]:(X4 @ (esk30_2 @ X3 @ X4)|r1 @ X3 @ (esk29_2 @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.21/0.44	thf(c_0_23, axiom, (mexists_ind)=(^[X11:mu > $i > $o, X43:$i]:~(![X46:mu]:~(X11 @ X46 @ X43))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mexists_ind, mnot]), mforall_ind])).
0.21/0.44	thf(c_0_24, axiom, (mdia)=(^[X13:$i > $i > $o, X6:$i > $o, X60:$i]:~(![X63:$i]:(~(X13 @ X60 @ X63)|~(X6 @ X63)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[mdia, mnot]), mbox])).
0.21/0.44	thf(c_0_25, plain, ![X2258:$i, X2259:mu, X2260:$i]:(~maths_teacher @ X2259 @ X2258|(~r4 @ X2258 @ X2260|good_in_maths @ X2259 @ X2260)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])])).
0.21/0.44	thf(c_0_26, plain, ![X2427:$i]:maths_teacher @ john @ X2427, inference(variable_rename,[status(thm)],[c_0_19])).
0.21/0.44	thf(c_0_27, plain, ![X4:$i > $o, X3:$i, X14:$i]:(X4 @ X14|~X4 @ (esk44_2 @ X3 @ X4)|~r1 @ X3 @ X14), inference(split_conjunct,[status(thm)],[c_0_20])).
0.21/0.44	thf(c_0_28, plain, ![X3:$i]:r1 @ X3 @ (esk30_2 @ X3 @ (r1 @ X3)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.21/0.44	thf(c_0_29, plain, ![X4:$i > $o, X3:$i, X14:$i]:(r4 @ X3 @ (esk44_2 @ X3 @ X4)|X4 @ X14|~r1 @ X3 @ X14), inference(split_conjunct,[status(thm)],[c_0_20])).
0.21/0.44	thf(c_0_30, negated_conjecture, ~(![X682:$i]:~(![X686:mu]:~(~(![X687:$i]:(~r1 @ X682 @ X687|~good_in_maths @ X686 @ X687))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_23]), c_0_24]), mvalid])])).
0.21/0.44	thf(c_0_31, plain, ![X3:$i, X1:mu, X14:$i]:(good_in_maths @ X1 @ X14|~maths_teacher @ X1 @ X3|~r4 @ X3 @ X14), inference(split_conjunct,[status(thm)],[c_0_25])).
0.21/0.44	thf(c_0_32, plain, ![X3:$i]:maths_teacher @ john @ X3, inference(split_conjunct,[status(thm)],[c_0_26])).
0.21/0.44	thf(c_0_33, plain, ![X3:$i, X4:$i > $o]:(X4 @ (esk30_2 @ X3 @ (r1 @ X3))|~X4 @ (esk44_2 @ X3 @ X4)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.21/0.44	thf(c_0_34, plain, ![X3:$i, X4:$i > $o]:(X4 @ (esk30_2 @ X3 @ (r1 @ X3))|r4 @ X3 @ (esk44_2 @ X3 @ X4)), inference(spm,[status(thm)],[c_0_29, c_0_28])).
0.21/0.44	thf(c_0_35, negated_conjecture, ![X2284:mu, X2285:$i]:(~r1 @ esk22_0 @ X2285|~good_in_maths @ X2284 @ X2285), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])).
0.21/0.44	thf(c_0_36, plain, ![X14:$i, X3:$i]:(good_in_maths @ john @ X3|~r4 @ X14 @ X3), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.21/0.44	thf(c_0_37, plain, ![X3:$i]:r4 @ X3 @ (esk30_2 @ X3 @ (r1 @ X3)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
0.21/0.44	thf(c_0_38, negated_conjecture, ![X1:mu, X3:$i]:(~r1 @ esk22_0 @ X3|~good_in_maths @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_35])).
0.21/0.44	thf(c_0_39, plain, ![X3:$i]:good_in_maths @ john @ (esk30_2 @ X3 @ (r1 @ X3)), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.21/0.44	thf(c_0_40, negated_conjecture, ![X3:$i]:~r1 @ esk22_0 @ (esk30_2 @ X3 @ (r1 @ X3)), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.21/0.44	thf(c_0_41, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_40, c_0_28]), ['proof']).
0.21/0.44	# SZS output end CNFRefutation
0.21/0.44	# Proof object total steps             : 42
0.21/0.44	# Proof object clause steps            : 15
0.21/0.44	# Proof object formula steps           : 27
0.21/0.44	# Proof object conjectures             : 6
0.21/0.44	# Proof object clause conjectures      : 3
0.21/0.44	# Proof object formula conjectures     : 3
0.21/0.44	# Proof object initial clauses used    : 7
0.21/0.44	# Proof object initial formulas used   : 14
0.21/0.44	# Proof object generating inferences   : 8
0.21/0.44	# Proof object simplifying inferences  : 0
0.21/0.44	# Training examples: 0 positive, 0 negative
0.21/0.44	# Parsed axioms                        : 145
0.21/0.44	# Removed by relevancy pruning/SinE    : 0
0.21/0.44	# Initial clauses                      : 185
0.21/0.44	# Removed in clause preprocessing      : 47
0.21/0.44	# Initial clauses in saturation        : 138
0.21/0.44	# Processed clauses                    : 377
0.21/0.44	# ...of these trivial                  : 1
0.21/0.44	# ...subsumed                          : 0
0.21/0.44	# ...remaining for further processing  : 376
0.21/0.44	# Other redundant clauses eliminated   : 0
0.21/0.44	# Clauses deleted for lack of memory   : 0
0.21/0.44	# Backward-subsumed                    : 0
0.21/0.44	# Backward-rewritten                   : 0
0.21/0.44	# Generated clauses                    : 862
0.21/0.44	# ...of the previous two non-trivial   : 781
0.21/0.44	# Contextual simplify-reflections      : 0
0.21/0.44	# Paramodulations                      : 830
0.21/0.44	# Factorizations                       : 0
0.21/0.44	# NegExts                              : 0
0.21/0.44	# Equation resolutions                 : 0
0.21/0.44	# Propositional unsat checks           : 0
0.21/0.44	#    Propositional check models        : 0
0.21/0.44	#    Propositional check unsatisfiable : 0
0.21/0.44	#    Propositional clauses             : 0
0.21/0.44	#    Propositional clauses after purity: 0
0.21/0.44	#    Propositional unsat core size     : 0
0.21/0.44	#    Propositional preprocessing time  : 0.000
0.21/0.44	#    Propositional encoding time       : 0.000
0.21/0.44	#    Propositional solver time         : 0.000
0.21/0.44	#    Success case prop preproc time    : 0.000
0.21/0.44	#    Success case prop encoding time   : 0.000
0.21/0.44	#    Success case prop solver time     : 0.000
0.21/0.44	# Current number of processed clauses  : 238
0.21/0.44	#    Positive orientable unit clauses  : 32
0.21/0.44	#    Positive unorientable unit clauses: 0
0.21/0.44	#    Negative unit clauses             : 4
0.21/0.44	#    Non-unit-clauses                  : 202
0.21/0.44	# Current number of unprocessed clauses: 680
0.21/0.44	# ...number of literals in the above   : 2013
0.21/0.44	# Current number of archived formulas  : 0
0.21/0.44	# Current number of archived clauses   : 138
0.21/0.44	# Clause-clause subsumption calls (NU) : 13237
0.21/0.44	# Rec. Clause-clause subsumption calls : 7666
0.21/0.44	# Non-unit clause-clause subsumptions  : 0
0.21/0.44	# Unit Clause-clause subsumption calls : 494
0.21/0.44	# Rewrite failures with RHS unbound    : 0
0.21/0.44	# BW rewrite match attempts            : 0
0.21/0.44	# BW rewrite match successes           : 0
0.21/0.44	# Condensation attempts                : 0
0.21/0.44	# Condensation successes               : 0
0.21/0.44	# Termbank termtop insertions          : 48191
0.21/0.44	
0.21/0.44	# -------------------------------------------------
0.21/0.44	# User time                : 0.086 s
0.21/0.44	# System time              : 0.007 s
0.21/0.44	# Total time               : 0.093 s
0.21/0.44	# Maximum resident set size: 1792 pages
0.21/0.44	EOF